On $2k$-Variable Symmetric Boolean Functions with Maximum Algebraic Immunity $k$

نویسندگان

  • Hui Wang
  • Jie Peng
  • Yuan Li
  • Haibin Kan
چکیده

Algebraic immunity of Boolean function f is defined as the minimal degree of a nonzero g such that fg = 0 or (f + 1)g = 0. Given a positive even integer n, it is found that the weight distribution of any n-variable symmetric Boolean function with maximum algebraic immunity n 2 is determined by the binary expansion of n. Based on the foregoing, all n-variable symmetric Boolean functions with maximum algebraic immunity are constructed. The amount is (2wt(n) + 1)22 .

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Constructing and Counting Even-Variable Symmetric Boolean Functions with Algebraic Immunity not Less Than $d$

In this paper, we explicitly construct a large class of symmetric Boolean functions on 2k variables with algebraic immunity not less than d, where integer k is given arbitrarily and d is a given suffix of k in binary representation. If let d = k, our constructed functions achieve the maximum algebraic immunity. Remarkably, 22 k⌋+2 symmetric Boolean functions on 2k variables with maximum algebra...

متن کامل

Balanced Boolean Functions with (Almost) Optimal Algebraic Immunity and Very High Nonlinearity

In this paper, we present a class of 2k-variable balanced Boolean functions and a class of 2k-variable 1-resilient Boolean functions for an integer k ≥ 2, which both have the maximal algebraic degree and very high nonlinearity. Based on a newly proposed conjecture by Tu and Deng, it is shown that the proposed balanced Boolean functions have optimal algebraic immunity and the 1-resilient Boolean...

متن کامل

Boolean functions with all main cryptographic properties

In this paper, we propose a class of 2k-variable Boolean functions which have optimal algebraic degree, very high nonlinearity, and are 1-resilient. Based on our newly proposed conjecture, it can be shown that the algebraic immunity of our functions is at least suboptimal. Moreover, when k is odd, the algebraic immunity is actually optimal, and for even k, we find that the algebraic immunity is...

متن کامل

New Construction of Even-variable Rotation Symmetric Boolean Functions with Optimum Algebraic Immunity

The rotation symmetric Boolean functions which are invariant under the action of cyclic group have been used as components of different cryptosystems. In order to resist algebraic attacks, Boolean functions should have high algebraic immunity. This paper studies the construction of even-variable rotation symmetric Boolean functions with optimum algebraic immunity. We construct ( / 4 3) n    ...

متن کامل

1-Resilient Boolean Function with Optimal Algebraic Immunity

In this paper, We propose a class of 2k-variable Boolean functions, which have optimal algebraic degree, high nonlinearity, and are 1resilient. These functions have optimal algebraic immunity when k > 2 and u = −2, 0 ≤ l < k. Based on a general combinatorial conjecture, algebraic immunity of these functions is optimal when k > 2 and u = 2, 0 ≤ l < k. If the general combinatorial conjecture and ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Information Theory

دوره 58  شماره 

صفحات  -

تاریخ انتشار 2012